Some properties of random λ-terms∗
نویسندگان
چکیده
We present quantitative analysis of various (syntactic and behavioral) properties of random λ-terms. Our main results are that asymptotically all the terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the λ-calculus into combinators) the result is exactly opposite. We show that almost all terms are not strongly normalizing. This due to the fact that any fixed combinator almost always appears in a random combinator.
منابع مشابه
3 1 M ar 2 00 9 Some properties of random λ - terms
We show various (syntactic and behavioral) properties of random λ-terms. Our main results are that at least 3/4 of the terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the λ-calculus into combinators) the result is different. We show that almost all terms are not strongly normalizing, beca...
متن کاملAsymptotically almost all λ - terms are strongly normalizing ∗
We present a quantitative analysis of various (syntactic and behavioral) properties of random λ-terms. Our main results show that asymptotically, almost all terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the λ-calculus into combinators), the result is exactly opposite. We show that almos...
متن کاملAsymptotically almost all \lambda-terms are strongly normalizing
We present quantitative analysis of various (syntactic and behavioral) properties of random λ-terms. Our main results are that asymptotically all the terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the λ-calculus into combinators) the result is exactly opposite. We show that almost all te...
متن کاملPHYSTAT 2011 Bayes and Discovery: Objective Bayesian Hypothesis Testing
Let z be the available data which are assumed to have been generated as one random observation from model Mz = {p(z |ω),z ∈ Z,ω ∈ Ω}. Often, but not always, data will consist of a random sample z = {x1, . . . ,xn} from some distribution q(x |ω), with x ∈ X ; in this case p(z |ω) = Qn i=1 q(xi |ω) and Z = X . Let θ(ω) be the vector of interest. Without loss of generality, the model may explicitl...
متن کاملA parallel to the null ideal for inaccessible λ: Part I
It is well known to generalize the meagre ideal replacing ℵ 0 by a (regular) cardinal λ > ℵ 0 and requiring the ideal to be λ +-complete. But can we generalize the null ideal? In terms of forcing, this means finding a forcing notion similar to the random real forcing, replacing ℵ 0 by λ, so requiring it to be (< λ)-complete. Of course, we would welcome additional properties generalizing the one...
متن کامل